A fast algorithm for finding junction trees 81 A sufficientlyfast algorithm for finding close to optimal junction trees
نویسندگان
چکیده
Au algorithm is developed for findiug a close to optimal junction tree of a given graph Tile algorithm has a worst case co~nplexity O(ckn~) where a and c are coustants, the nmnber of vertices, and k is largest clique in a juuction tree of G in which this size is mini~nized. The algorithm guarantees that the logarittHn of the size of the state space of the heaviest clique in the junction tree produced is less than a constant factor off the optional value. Wt~en k = our algoritlnn yields a polynomial inference algorithm for Bayesian networks.
منابع مشابه
A sufficiently fast algorithm for finding close to optimal junction trees
An algorithm is developed for finding a close to optimal junction tree of a given graph G. The algorithm has a worst case complexity 0 (c k n a) where a and c are constants, n is the number of vertices , and k is the size of the largest clique in a junction tree of Gi n which this size is minimized. The algorithm guaran tees that the logarithm of the size of the state space of the heaviest cli...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملGraphical Models as Block-Tree Graphs
We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge always have at least one common node. When compared to junction-trees, we show ...
متن کاملLearning Thin Junction Trees via Graph Cuts
Structure learning algorithms usually focus on the compactness of the learned model. However, for general compact models, both exact and approximate inference are still NP-hard. Therefore, the focus only on compactness leads to learning models that require approximate inference techniques, thus reducing their prediction quality. In this paper, we propose a method for learning an attractive clas...
متن کاملValue of Information Analysis in Dynamic Decision Models
Decision-making under dynamic environments is an important problem frequently encountered in the practice. In this paper, we reveal some properties of value of information in dynamic environment, and compare the results with that in different representations by other researchers. We study the time invariant features in dynamic influence diagrams (DID) to enhance the value of information calcula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996